Recursive Nonlinear Set–Theoretic Estimation Based on Pseudo Ellipsoids
نویسنده
چکیده
In this paper, the problem of estimating a vector x of unknown quantities based on a set of measurements depending nonlinearly on x is considered. The measurements are assumed to be taken sequentially and are corrupted by unknown but bounded uncertainties. For this uncertainty model, a systematic design approach is introduced, which yields closed–form expressions for the desired nonlinear estimates. The estimates are recursively calculated and provide solution sets X containing the feasible sets, i.e., the sets of all x consistent with all the measurements available and their associated bounds. The sets X are tight upper bounds for the exact feasible sets and are in general not convex and not connected. The proposed design approach is versatile and the resulting nonlinear filter algorithms are both easy to implement and efficient.
منابع مشابه
Ellipsoidal Approximations in Set-Membership State Estimation of Linear Discrete-Time Systems
There are mainly two approaches to the state estimation or the system identification problems, where the system contains additive unknown values. One is the well-known stochastic approach, and the other is the setmembership approach, where the unknown values are treated as unknown deterministic values in bounded sets. In this paper, we consider the state estimation of linear systems when the in...
متن کاملEstimation of dynamically evolving ellipsoids with applications to medical imaging
The estimation of dynamically evolving ellipsoids from noisy lower-dimensional projections is examined. In particular, this work describes a model-based approach using geometric reconstruction and recursive estimation techniques to obtain a dynamic estimate of left-ventricular ejection fraction from a gated set of planar myocardial perfusion images. The proposed approach differs from current ej...
متن کاملBounded Error Estimation: Set-Theoretic and Least-Squares Formulations
An Optimal Bounding Ellipsoid (OBE) algorithm with asymptotic convergence properties and a selective update capability is developed in this paper. Interesting geometrical insights into the updating rule are found. This algorithm is shown to be robust with respect to certain model violations. Convergence of the algorithm can be established even when the assumption of bounding ellipsoids breaks d...
متن کاملSet Theoretic Localization of Fast Using an Angle Measurement Mobile Robots Technique
W e study the problem of localizing a mobile robot with a n onboard-device making angular measurements on the location of known but undistinguishable landmarks. Noiiel algorithms are proposed for I. efficient posture initialization based o n a simple linear solution and f o r 2. recursive posture estimation. Derived in a set theoretic framework, the algorithms cope with nonwhite, nongaussian no...
متن کاملSet simulations for quadratic systems
In this note, we study the problem of propagating in time a bounding set for the state of a class of nonlinear quadratic systems. The sequence of bounding sets is called the set simulation of the system, and conveys useful information about the stability and qualitative behavior of the possible time responses of the system. Numerically efficient recursive algorithms are presented for the specif...
متن کامل